Revisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation
نویسندگان
چکیده
منابع مشابه
Revisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation
This paper proposes a new algorithm to generate a graded three-dimensional tetrahedral mesh. It revisits the class of methods based on optimal Delaunay triangulation (ODT) and proposes a proper way of injecting a background density function into the objective function minimized by ODT. This continuous/analytic point of view leads to an objective function that is continuous and Delaunay consiste...
متن کاملDelaunay-restricted Optimal Triangulation of 3D Polygons
Triangulation of 3D polygons is a well studied topic of research. Existing methods for finding triangulations that minimize given metrics (e.g., sum of triangle areas or dihedral angles) run in a costly $O(n^4)$ time \cite{Barequet95,Barequet96}, while the triangulations are not guaranteed to be free of intersections. To address these limitations, we restrict our search to the space of triangle...
متن کاملMesh Generation and Optimal Triangulation
We survey the computational geometry relevant to nite element mesh generation. We especially focus on optimal triangulations of geometric domains in twoand three-dimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some criterion that measures the size, shape, or number of triangles. We discuss algorithms both for the optimiza...
متن کاملConforming Centroidal Voronoi Delaunay Triangulation for Quality Mesh Generation
As the methodology of centroidal Voronoi tessellation (CVT) is receiving more and more attention in the mesh generation community, a clear characterization of the influence of geometric constraints on the CVT-based meshing is becoming increasingly important. In this paper, we first give a precise definition of the geometrically conforming centroidal Voronoi Delaunay triangulation (CfCVDT) and t...
متن کاملParallel 3D Delaunay Triangulation
The paper deals with the parallelization of Delaunay triangulation algorithms, giving more emphasis to pratical issues and implementation than to theoretical complexity. Two parallel implementations are presented. The first one is built on DeWall, an E triangulator based on an original interpretation of the divide & conquer paradigm. The second is based on an incremental construction algorithm....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2014
ISSN: 1064-8275,1095-7197
DOI: 10.1137/120875132